| 翻訳と辞書 |
| automata construction ： ウィキペディア英語版 |
automata construction
In automata theory, automata construction is an important mathematical technique used to demonstrate the existence of an automaton with a certain desired property. Very often, it is presented as an algorithm that takes a desired property as input and produces as output an automaton with the property.
Many hard problems in automata theory involve finding the right construction of an automaton such that the problem can be answered. For example, the famous construction in McNaughton's Theorem answered the question if non-deterministic Büchi automaton can always be translated into a ''deterministic'' Muller automaton.
==Example==
Powerset construction is an algorithm to construct a deterministic finite automaton from a given nondeterministic finite automaton.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「automata construction」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|